A SAT-based Method for Basis Path Testing using KodKod

A large portion of automated testing techniques has been developed for the statement or branch test coverage criteria. Among structural criteria, however, research on basis path testing has received little attention. The basis path testing requires a set of basis paths to be executed during testing. However, traditional testing methods for basis path generation consider only the control flow of a program and furthermore ignore loop. As a consequence, infeasible basis paths can be generated. In this paper, we present a goal-oriented testing method based on SAT(Boolean SATisfiability) for basis path testing. Specifically, the proposed method makes advantage of KodKod which is an efficient constraint solver for first order logic with relations. In the proposed method, KodKod is used to formulate a program and the basis path testing criterion to generate feasible basis paths of optimal lengths. Our method can generate test inputs on which basis paths are executed. We present a case study with some empirical results to show that the proposed method can generate feasible basis paths of optimal lengths effectively.